A formula on the weight distribution of linear codes with applications to AMDS codes
نویسندگان
چکیده
The determination of the weight distribution linear codes has been a fascinating problem since very beginning coding theory. There lot research on enumerators special cases, such as self-dual and with small Singleton's defect. We propose new set relations that must be satisfied by coefficients distribution. From these we are able to derive known identities (in an easier way) for interesting extremal codes, Hermitian MDS NMDS codes. Moreover, present first time AMDS also discuss link between our results Pless equations.
منابع مشابه
Computation of Minimum Hamming Weight for Linear Codes
In this paper, we consider the minimum Hamming weight for linear codes over special finite quasi-Frobenius rings. Furthermore, we obtain minimal free $R$-submodules of a finite quasi-Frobenius ring $R$ which contain a linear code and derive the relation between their minimum Hamming weights. Finally, we suggest an algorithm that computes this weight using the Grobner basis and we show that und...
متن کاملSupport weight distribution of linear codes
Klove, T., Support weight distribution of linear codes, Discrete Mathematics 106/107 (1992) 311-316. The main result of the paper is expressions for the support weight distributions of a linear code in terms of the support weight distributions of the dual code.
متن کاملOn the weight distribution of binary linear codes (Corresp.)
Let V be a binary linear (n,k)-code defined by a check matrixHwithcohmmsh,,~~~,h,,,andleth(x)=l ifxE(h,;..,h,),and h(x)=0 if x@{h,;.. ,h,}. A combinatorial argument relates the Walsh transform of h(x) with the weight distribution A(i) of the code V for small i(i< 7). This leads to another proof of the Pless ith power moment identities for i < 7. This relation also provides a simple method for c...
متن کاملOne-point Goppa Codes on Some Genus 3 Curves with Applications in Quantum Error-Correcting Codes
We investigate one-point algebraic geometric codes CL(D, G) associated to maximal curves recently characterized by Tafazolian and Torres given by the affine equation yl = f(x), where f(x) is a separable polynomial of degree r relatively prime to l. We mainly focus on the curve y4 = x3 +x and Picard curves given by the equations y3 = x4-x and y3 = x4 -1. As a result, we obtain exact value of min...
متن کاملLinear codes with complementary duals related to the complement of the Higman-Sims graph
In this paper we study codes $C_p(overline{{rm HiS}})$ where $p =3,7, 11$ defined by the 3- 7- and 11-modular representations of the simple sporadic group ${rm HS}$ of Higman and Sims of degree 100. With exception of $p=11$ the codes are those defined by the row span of the adjacency matrix of the complement of the Higman-Sims graph over $GF(3)$ and $GF(7).$ We show that these codes ha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Finite Fields and Their Applications
سال: 2022
ISSN: ['1090-2465', '1071-5797']
DOI: https://doi.org/10.1016/j.ffa.2021.101933